|

| Thursday, June 13, 2002, 2:00 PM - 4:00 PM | Room: Auditorium A
|
 |
SESSION 47
|
| Advances in SAT
 |
| Chair: Joao Marques-Silva - IST/INESC, Lisboa,
Chair:
|
| Organizers: Malgorzata Marek-Sadowska, Soha M Hassoun
|
| This session focuses on different techniques to enhance Boolean SAT solvers. The first paper presents a proof engine to combine different SAT-solving strategies. The second paper utilizes symmetry to speed-up solvers. The third paper describes a tool that reports the percentage of search space explored by the solver. The fourth paper proposes several optimization techniques that can improve speed. The last paper combines circuit-based and CNF-based algorithms.
|
| 47.1 |
A Proof Engine Approach to Solving Combinational Design Automation Problems
 |
|  | Speaker(s): | Per Bjesse - Prover Tech., Portland, OR
|
|  | Author(s): | Gunnar Andersson - Prover Tech., Stockholm, SWE
Per Bjesse - Prover Tech., Portland, OR
Byron Cook - Prover Tech., Portland, OR
Ziyad Hanna - Intel Corp., Haifa, Israel
|
| 47.2 | Solving Difficult SAT Instances in the Presense of Symmetry |
| Speaker(s): | Igor Markov - Univ. of Michigan, Ann Arbor, MI
|
| Author(s): | Fadi A. Aloul - Univ. of Michigan, Ann Arbor, MI
Arathi Ramani - Univ. of Michigan, Ann Arbor, MI
Igor Markov - Univ. of Michigan, Ann Arbor, MI
Karem Sakallah - Univ. of Michigan, Ann Arbor, MI
|
| 47.3 | Satometer: How Much Have We Searched? |
| Speaker(s): | Fadi A. Aloul - Univ. of Michigan, Ann Arbor, MI
|
| Author(s): | Fadi A. Aloul - Univ. of Michigan, Ann Arbor, MI
Brian Sierawski - Univ. of Michigan, Ann Arbor, MI
Karem Sakallah - Univ. of Michigan, Ann Arbor, MI
|
| 47.4 | SAT with Partial Clauses and Back-Leaps |
| Speaker(s): | Slawomir Pilarski - Synopsys, Inc., Beaverton, OR
|
| Author(s): | Slawomir Pilarski - Synopsys, Inc., Beaverton, OR
Gracia Hu - Synopsys, Inc., Beaverton, OR
|
| 47.5 | Combining Strengths of Circuit-Based and CNF-Based Algorithms For a High-Performance SAT Solver |
| Speaker(s): | Malay K. Ganai - NEC Corp., Princeton, NJ
|
| Author(s): | Malay K. Ganai - NEC Corp., Princeton, NJ
Lintao Zhang - Princeton Univ., Princeton, NJ
Pranav N. Ashar - NEC Corp., Princeton, NJ
Aarti Gupta - NEC Corp., Princeton, NJ
Sharad Malik - Princeton Univ., Princeton, NJ
|
  |
|